Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language

Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language

where b ranges over a set BExp of boolean expressions, a ranges over a set Act of basic actions and p is a real number with 0 < p < 1. The aim of the current paper is to perform this task for the partial correctness case where the direct semantics of a program P is given by a function from the set S of states to PLV(S), the convex lower powerdomain of valuations on S. Here V(S) is the set of al...

A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language

where b ranges over a set BExp of boolean expressions, a ranges over a set Act of basic actions and p is a real number with 0 < p < 1. We write cond(b, P,Q) for the conditional usually denoted as if b then P else Q fi and while(b, P ) for the while loop usually denoted as while b do P od The program P8Q nondeterministically executes either P or Q. The program P p⊕Q executes P with probability p...

Predicate Transformer Semantics of a Higher Order Imperative Language With . . .

Predicate transformer semantics of a higher-order imperative language with record subtyping

Using a set-theoretic model of predicate transformers and ordered data types, we give a total-correctness semantics for a higher order imperative programming language that includes record extension, local variables, and procedure-type variables and parameters. The language includes infeasible speciication constructs, for a calculus of reenement. Procedures may have global variables, subject to ...

Relating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs

A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be i...